Optimizing Multiple Simultaneous Objectives for Voting and Facility Location

نویسندگان

چکیده

We study the classic facility location setting, where we are given n clients and m possible locations in some arbitrary metric space, want to choose a build facility. The exact same setting also arises spatial social choice, voters goal is candidate or outcome, with distance from voter an outcome representing cost of this for (e.g., based on their ideological differences). Unlike most previous work, do not focus single objective optimize total facility, maximum distance, etc.), but instead attempt several different objectives simultaneously. More specifically, consider l-centrum family objectives, which includes max many others. present tight bounds how well any pair such sum) can be simultaneously approximated compared optimum outcomes. In particular, show that it always approximates both within factor 1 plus square root 2, give precise characterization improves as two being optimized become more similar. For q>2 centrum approximate all q these small constant, constant approaches 3 increases. Our results when optimizing only few simultaneous form significantly better than approximation objectives.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple voting location problems

The facility voting location problems arise from the application of criteria derived from the voting processes concerning the location of facilities. The multiple location problems are those location problems in which the alternative solutions are sets of points. This paper extends previous results and notions on single voting location problems to the location of a set of facility points. The a...

متن کامل

Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games

We study Facility Location games, where a number of facilities are placed in a metric space based on locations reported by strategic agents. A mechanism maps the agents’ locations to a set of facilities. The agents seek to minimize their connection cost, namely the distance of their true location to the nearest facility, and may misreport their location. We are interested in mechanisms that are...

متن کامل

Optimizing Multiple Objectives on Multicast Networks using Memetic Algorithms

In this paper, we propose the use of Memetics Algorithms for solving multiobjective network problems. The aim is to minimize total delay and total hop count on sending a multicast flow through a network. We propose a heuristic that avoid the creation of subgraphs for finding paths. The heuristic combined with multiobjective evolutionary algorithms have shown similar results to the results obtai...

متن کامل

Training dependency parsers by jointly optimizing multiple objectives

We present an online learning algorithm for training parsers which allows for the inclusion of multiple objective functions. The primary example is the extension of a standard supervised parsing objective function with additional loss-functions, either based on intrinsic parsing quality or task-specific extrinsic measures of quality. Our empirical results show how this approach performs for two...

متن کامل

Tight Complexity Bounds for Optimizing Composite Objectives

We provide tight upper and lower bounds on the complexity of minimizing the average of m convex functions using gradient and prox oracles of the component functions. We show a significant gap between the complexity of deterministic vs randomized optimization. For smooth functions, we show that accelerated gradient descent (AGD) and an accelerated variant of SVRG are optimal in the deterministic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2023

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v37i5.25703